The Conjugacy Problem for Groups, and Higman Embeddings
نویسندگان
چکیده
For every finitely generated recursively presented group G we construct a finitely presented group H containing G such that G is (Frattini) embedded into H and the group H has solvable conjugacy problem if and only if G has solvable conjugacy problem. Moreover, G and H have the same r.e. Turing degrees of the conjugacy problem. This solves a problem by D.
منابع مشابه
The Conjugacy Problem and Higman Embeddings
For every finitely generated recursively presented group G we construct a finitely presented group H containing G such that G is (Frattini) embedded into H and the group H has solvable conjugacy problem if and only if G has solvable conjugacy problem. Moreover G and H have the same r.e. Turing degrees of the conjugacy problem. This solves a problem by D. Collins.
متن کاملTuring Degrees and the Word and Conjugacy Problems for Finitely Presented Groups
The unsolvability of the conjugacy problem for finitely presented groups was first shown by Novikov [26]. Shortly thereafter the corresponding result for the word problem was proved by Novikov [27] and Boone [6] (see also Boone [7], Higman [20] and Britton [9]). Friedberg [19] and Mucnik [25] revitalised the theory of recursively enumerable (r.e.) Turing degrees by showing that there are degree...
متن کاملThe Conjugacy Problem in Wreath Products and Free Metabelian Groups
1. Introduction. The conjugacy problem was formulated by Dehn in 1912 for finitely presented groups [1]. The question was whether it can be effectively determined for such a group when two elements are conjugate. This general question was answered in the negative by Novikov in 1954 [6J. But it is still of interest to determine whether the problem is solvable for particular finitely presented gr...
متن کاملAlgorithmic and asymptotic properties of groups
This is a survey of the recent work in algorithmic and asymptotic properties of groups. I discuss Dehn functions of groups, complexity of the word problem, Higman embeddings, and constructions of finitely presented groups with extreme properties (monsters). Mathematics Subject Classification (2000). Primary 20F65; Secondary 20F10.
متن کاملSubnormal Embedding Theorems for Groups
In this paper we establish some subnormal embeddings of groups into groups with additional properties; in particular embeddings of countable groups into 2-generated groups with some extra properties. The results obtained are generalizations of theorems of P. Hall, R. Dark, B. Neumann, Hanna Neumann, G. Higman on embeddings of that type. Considering subnormal embeddings of finite groups into fin...
متن کامل